λ-calculus in an algebraic setting
نویسنده
چکیده
We define an extension of λ-calculus with linear combinations of terms, with coefficients taken in a fixed rig R. We extend β-reduction on these terms as follows: at + u reduces to at + u as soon as term t reduces to t and a is a non-zero scalar. We prove that reduction is confluent. Under the assumption that R is a positive rig (i.e. a sum of scalars is zero iff all of them are zero), we show that this algebraic λ-calculus is a conservative extension of ordinary λ-calculus: two ordinary λ-terms equalized by the reduction of algebraic λ-calculus are β-equal. Last, we prove that under some reasonably minimal conditions on R, simply typed algebraic λ-terms are strongly normalizing. Preliminary definitions and notations. Let R be a rig. We denote by letters a, b, c the elements of R. We say that R is positive if for all a, b ∈ R, a + b = 0 implies a = 0 and b = 0. An example of positive rig is N, the set of natural numbers. We write R for R \ {0}. If i, j ∈ N, we write [i, j] for the set {k ∈ N; i ≤ k ≤ j}. Also, we write λ-terms à la Krivine: (s) t denotes the application of term s to term t.
منابع مشابه
Normalizing the Taylor expansion of non-deterministic {\lambda}-terms, via parallel reduction of resource vectors
It has been known since Ehrhard and Regnier’s seminal work on the Taylor expansion of λ-terms that this operation commutes with normalization: the expansion of a λ-term is always normalizable and its normal form is the expansion of the Böhm tree of the term. We generalize this result to the non-uniform setting of the algebraic λ-calculus, i.e., λ-calculus extended with linear combinations of te...
متن کاملKrivine Machine and Taylor Expansion in a Non-uniform Setting
The Krivine machine is an abstract machine implementing the linear head reduction of λ -calculus. Ehrhard and Regnier gave a resource sensitive version returning the annotated form of a λ -term accounting for the resources used by the linear head reduction. These annotations take the form of terms in the resource λ -calculus. We generalize this resource-driven Krivine machine to the case of the...
متن کاملConfluence via strong normalisation in an algebraic lambda-calculus with rewriting
The linear-algebraic λ -calculus and the algebraic λ -calculus are untyped λ -calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while the latter uses equalities. When given by rewrites, algebraic λ -calculi are not confluent unless further restrictions are added. We provide a type system for the linear...
متن کاملA characterization of the Taylor expansion of λ-terms∗
The Taylor expansion of λ-terms, as introduced by Ehrhard and Regnier, expresses a λ-term as a series of multi-linear terms, called simple terms, which capture bounded computations. Normal forms of Taylor expansions give a notion of infinitary normal forms, refining the notion of Böhm trees in a quantitative setting. We give the algebraic conditions over a set of normal simple terms which chara...
متن کاملCall-by-value, call-by-name and the vectorial behaviour of the algebraic \lambda-calculus
We examine the relationship between the algebraic λ-calculus, a fragment of the differential λ-calculus and the linear-algebraic λ-calculus, a candidate λ-calculus for quantum computation. Both calculi are algebraic: each one is equipped with an additive and a scalarmultiplicative structure, and their set of terms is closed under linear combinations. However, the two languages were built using ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006